0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.13	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.12/0.33	% Computer   : n018.cluster.edu
0.12/0.33	% Model      : x86_64 x86_64
0.12/0.33	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory     : 8042.1875MB
0.12/0.33	% OS         : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1200
0.12/0.33	% WCLimit    : 120
0.12/0.33	% DateTime   : Tue Jul 13 15:34:53 EDT 2021
0.12/0.33	% CPUTime    : 
0.12/0.33	% Number of cores: 8
0.12/0.33	% Python version: Python 3.6.8
0.12/0.33	# Version: 2.6rc1-ho
0.12/0.34	# No SInE strategy applied
0.12/0.34	# Trying AutoSched0 for 59 seconds
0.18/0.55	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.18/0.55	# and selection function SelectMaxLComplexAvoidPosPred.
0.18/0.55	#
0.18/0.55	# Preprocessing time       : 0.070 s
0.18/0.55	
0.18/0.55	# Proof found!
0.18/0.55	# SZS status Theorem
0.18/0.55	# SZS output start CNFRefutation
0.18/0.55	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.18/0.55	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.18/0.55	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.18/0.55	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.18/0.55	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)).
0.18/0.55	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X416:$i]:(in @ X416 @ X1=>(X2 @ X416=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.18/0.55	thf(def_n_is, axiom, (n_is)=(^[X492:$i, X493:$i]:(X492)=(X493)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.18/0.55	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.18/0.55	thf(def_n_some, axiom, (n_some)=(^[X494:$i > $o]:(![X495:$i]:(in @ X495 @ nat=>(X494 @ X495=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.18/0.55	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)).
0.18/0.55	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X516:$i]:(in @ X516 @ nat=>((X1)=(n_pl @ X184 @ X516)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)).
0.18/0.55	thf(satz18b, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:d_29_ii @ (ordsucc @ X1) @ X1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz18b)).
0.18/0.55	thf(satz4e, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz4e)).
0.18/0.55	thf(n_1_p, axiom, is_of @ n_1 @ (^[X1:$i]:in @ X1 @ nat), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', n_1_p)).
0.18/0.55	thf(c_0_14, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.18/0.55	thf(c_0_15, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.18/0.55	thf(c_0_16, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_14])).
0.18/0.55	thf(c_0_17, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X416:$i]:(in @ X416 @ X1=>(X2 @ X416=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_15]), c_0_14]), c_0_16])).
0.18/0.55	thf(c_0_18, axiom, (n_is)=(^[X492:$i, X493:$i]:(X492)=(X493)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.18/0.55	thf(c_0_19, axiom, (n_some)=(^[X494:$i > $o]:(![X495:$i]:(in @ X495 @ nat=>(X494 @ X495=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_17])).
0.18/0.55	thf(c_0_20, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_18])).
0.18/0.55	thf(c_0_21, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X516:$i]:(in @ X516 @ nat=>((X1)=(n_pl @ X184 @ X516)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_19]), c_0_20])).
0.18/0.55	thf(c_0_22, negated_conjecture, ~(![X806:$i]:(in @ X806 @ nat=>~(![X810:$i]:(in @ X810 @ nat=>(ordsucc @ X806)!=(n_pl @ X806 @ X810))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz18b]), c_0_15]), c_0_21])])).
0.18/0.55	thf(c_0_23, plain, ![X1150:$i]:(in @ X1150 @ nat=>(ordsucc @ X1150)=(n_pl @ X1150 @ n_1)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz4e, c_0_15]), c_0_18])).
0.18/0.55	thf(c_0_24, negated_conjecture, ![X1894:$i]:(in @ esk42_0 @ nat&(~in @ X1894 @ nat|(ordsucc @ esk42_0)!=(n_pl @ esk42_0 @ X1894))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])).
0.18/0.55	thf(c_0_25, plain, ![X1956:$i]:(~in @ X1956 @ nat|(ordsucc @ X1956)=(n_pl @ X1956 @ n_1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])).
0.18/0.55	thf(c_0_26, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(ordsucc @ esk42_0)!=(n_pl @ esk42_0 @ X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
0.18/0.55	thf(c_0_27, plain, ![X1:$i]:((ordsucc @ X1)=(n_pl @ X1 @ n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_25])).
0.18/0.55	thf(c_0_28, negated_conjecture, in @ esk42_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_24])).
0.18/0.55	thf(c_0_29, plain, in @ n_1 @ nat, inference(apply_def,[status(thm)],[n_1_p, def_is_of])).
0.18/0.55	thf(c_0_30, negated_conjecture, ![X1:$i]:((n_pl @ esk42_0 @ n_1)!=(n_pl @ esk42_0 @ X1)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])])).
0.18/0.55	thf(c_0_31, plain, in @ n_1 @ nat, inference(split_conjunct,[status(thm)],[c_0_29])).
0.18/0.55	thf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_30]), c_0_31])]), ['proof']).
0.18/0.55	# SZS output end CNFRefutation
0.18/0.55	# Proof object total steps             : 33
0.18/0.55	# Proof object clause steps            : 6
0.18/0.55	# Proof object formula steps           : 27
0.18/0.55	# Proof object conjectures             : 7
0.18/0.55	# Proof object clause conjectures      : 4
0.18/0.55	# Proof object formula conjectures     : 3
0.18/0.55	# Proof object initial clauses used    : 4
0.18/0.55	# Proof object initial formulas used   : 14
0.18/0.55	# Proof object generating inferences   : 2
0.18/0.55	# Proof object simplifying inferences  : 4
0.18/0.55	# Training examples: 0 positive, 0 negative
0.18/0.55	# Parsed axioms                        : 367
0.18/0.55	# Removed by relevancy pruning/SinE    : 0
0.18/0.55	# Initial clauses                      : 537
0.18/0.55	# Removed in clause preprocessing      : 155
0.18/0.55	# Initial clauses in saturation        : 382
0.18/0.55	# Processed clauses                    : 409
0.18/0.55	# ...of these trivial                  : 8
0.18/0.55	# ...subsumed                          : 26
0.18/0.55	# ...remaining for further processing  : 375
0.18/0.55	# Other redundant clauses eliminated   : 559
0.18/0.55	# Clauses deleted for lack of memory   : 0
0.18/0.55	# Backward-subsumed                    : 0
0.18/0.55	# Backward-rewritten                   : 2
0.18/0.55	# Generated clauses                    : 4265
0.18/0.55	# ...of the previous two non-trivial   : 3636
0.18/0.55	# Contextual simplify-reflections      : 0
0.18/0.55	# Paramodulations                      : 3481
0.18/0.55	# Factorizations                       : 0
0.18/0.55	# NegExts                              : 1
0.18/0.55	# Equation resolutions                 : 596
0.18/0.55	# Propositional unsat checks           : 0
0.18/0.55	#    Propositional check models        : 0
0.18/0.55	#    Propositional check unsatisfiable : 0
0.18/0.55	#    Propositional clauses             : 0
0.18/0.55	#    Propositional clauses after purity: 0
0.18/0.55	#    Propositional unsat core size     : 0
0.18/0.55	#    Propositional preprocessing time  : 0.000
0.18/0.55	#    Propositional encoding time       : 0.000
0.18/0.55	#    Propositional solver time         : 0.000
0.18/0.55	#    Success case prop preproc time    : 0.000
0.18/0.55	#    Success case prop encoding time   : 0.000
0.18/0.55	#    Success case prop solver time     : 0.000
0.18/0.55	# Current number of processed clauses  : 342
0.18/0.55	#    Positive orientable unit clauses  : 75
0.18/0.55	#    Positive unorientable unit clauses: 3
0.18/0.55	#    Negative unit clauses             : 4
0.18/0.55	#    Non-unit-clauses                  : 260
0.18/0.55	# Current number of unprocessed clauses: 3609
0.18/0.55	# ...number of literals in the above   : 18130
0.18/0.55	# Current number of archived formulas  : 0
0.18/0.55	# Current number of archived clauses   : 2
0.18/0.55	# Clause-clause subsumption calls (NU) : 26531
0.18/0.55	# Rec. Clause-clause subsumption calls : 4023
0.18/0.55	# Non-unit clause-clause subsumptions  : 24
0.18/0.55	# Unit Clause-clause subsumption calls : 3158
0.18/0.55	# Rewrite failures with RHS unbound    : 2
0.18/0.55	# BW rewrite match attempts            : 23
0.18/0.55	# BW rewrite match successes           : 2
0.18/0.55	# Condensation attempts                : 0
0.18/0.55	# Condensation successes               : 0
0.18/0.55	# Termbank termtop insertions          : 134737
0.18/0.55	
0.18/0.55	# -------------------------------------------------
0.18/0.55	# User time                : 0.203 s
0.18/0.55	# System time              : 0.011 s
0.18/0.55	# Total time               : 0.214 s
0.18/0.55	# Maximum resident set size: 2212 pages
0.18/0.55	EOF